package leetcode.hot100;

import datastruct.list.ListNode;

public class Solution21 {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode virHead = new ListNode(), tail = virHead;
        while (l1!=null&&l2!=null){
            if(l1.val>l2.val){
                tail.next = l1;
                l1 = l1.next;
                tail = tail.next;
            }else {
                tail.next = l2;
                l2 = l2.next;
                tail = tail.next;
            }
        }
        if(l1!=null) tail.next = l1;
        if(l2!=null) tail.next = l2;
        tail.next = null;
        return virHead.next;
    }
}
